A First-order Prediction-Correction Algorithm for Time-varying (Constrained) Optimization
نویسندگان
چکیده
منابع مشابه
Prediction-Correction Interior-Point Method for Time-Varying Convex Optimization
In this paper, we develop an interior-point method for solving a class of convex optimization problems with timevarying objective and constraint functions. Using log-barrier penalty functions, we propose a continuous-time dynamical system for tracking the (time-varying) optimal solution with an asymptotically vanishing error. This dynamical system is composed of two terms: (i) a correction term...
متن کاملA New First-order Framework for Orthogonal Constrained Optimization Problems
In this paper, we consider a class of orthogonal constrained optimization problems, the feasible region of which is called the Stiefel manifold. Our new proposed framework combines a function value reduction step with a symmetrization step. Different from the existing approaches, the function value reduction is conducted in the Euclidean space instead of the Stiefel manifold or its tangent spac...
متن کاملA Time Varying Filtering Theory for Constrained
By extending the ltering theory under the (min; +)-algebra to the time varying setting, we solve the problem of constrained traac regulation and develop a calculus for dynamic service guarantees. For a constrained traac regulation problem with maximum tolerable delay d and maximum buuer size q, the optimal regulator that generates the output traac conforming to a subadditive envelope f and mini...
متن کاملCommutativity of First-order Discrete-Time Linear Time-varying Systems
After introducing the concept of commutativity for continuous-time linear time-varying systems, the related literature and the results obtained so far are presented. For a simple introduction of the commutativity of discrete-time linear time-varying systems, the problem is formulated for first-order systems. Finally, explicit necessary and sufficient conditions for the commutativity of first-or...
متن کاملA first-order stochastic primal-dual algorithm with correction step
We investigate the convergence properties of a stochastic primal-dual splitting algorithm for solving structured monotone inclusions involving the sum of a cocoercive operator and a composite monotone operator. The proposed method is the stochastic extension to monotone inclusions of a proximal method studied in [26, 35] for saddle point problems. It consists in a forward step determined by the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2017
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2017.08.1957